Minimizing the total completion time on-line on a single machine, using restartsVAN STEE, Rob; LA PCUTRE, Han.Journal of algorithms (Print). 2005, Vol 57, Num 2, pp 95-129, issn 0196-6774, 35 p.Article

Heuristics for scheduling a single machine subject to unequal job release timesREEVES, C.European journal of operational research. 1995, Vol 80, Num 2, pp 397-403, issn 0377-2217Article

On decomposition of the total tardiness problemCHANG, S; LU, Q; TANG, G et al.Operations research letters. 1995, Vol 17, Num 5, pp 221-229, issn 0167-6377Article

Single-machine scheduling with learning considerationsBISKUP, D.European journal of operational research. 1999, Vol 115, Num 1, pp 173-178, issn 0377-2217Article

An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due dateVENTURA, J. A; WENG, M. X.Operations research letters. 1995, Vol 17, Num 3, pp 149-152, issn 0167-6377Article

Some remarks on the decomposition properties of the single machine total tardiness problemSZWARC, Wlodzimierz.European journal of operational research. 2007, Vol 177, Num 1, pp 623-625, issn 0377-2217, 3 p.Article

On-line scheduling with tight deadlinesKOO, Chiu-Yuen; LAM, Tak-Wah; NGAN, Tsuen-Wan et al.Lecture notes in computer science. 2001, pp 464-473, issn 0302-9743, isbn 3-540-42496-2Conference Paper

On the calculation of harmonic air-gap fields in machines with single-sided slottingWILLIAMSON, S; FENG, Y. N.IEE conference publication. 2006, pp 671-675, issn 0537-9989, isbn 0-86341-618-7, 1Vol, 5 p.Conference Paper

Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervalsGORDON, Valery S; WERNER, F; YANUSHKEVICH, O. A et al.Operations research. 2001, Vol 35, Num 1, pp 71-83Article

Single machine scheduling to minimize total compression plus weighted flow cost is NP-hardGUOHUA WAN; YEN, Benjamin P.-C; LI, Chung-Lun et al.Information processing letters. 2001, Vol 79, Num 6, pp 273-280, issn 0020-0190Article

Décomposition temporelle et caractérisation de solutions admissibles pour le problème d'ordonnancement à une machine = Temporal decomposation and caracterization of admissible solution for scheduling problem with single machineLEVY, M.-L; LOPEZ, P; PRADIN, B et al.RAIRO. Recherche opérationnelle. 1999, Vol 33, Num 2, pp 185-208, issn 0399-0559Article

A note on the bicriterion scheduling problem involving total flowtime and range of latenessALIDAEE, B; CONLON, S.International journal of information and management sciences. 1997, Vol 8, Num 2, pp 1-7, issn 1017-1819Article

Single machine scheduling problem with fuzzy precedence relationISHII, H; TADA, M.European journal of operational research. 1995, Vol 87, Num 2, pp 284-288, issn 0377-2217Article

Weighted tardiness for the single machine scheduling problem: An examination of precedence theorem productivityKANET, J. J; BIRKEMEIER, C.Computers & operations research. 2013, Vol 40, Num 1, pp 91-97, issn 0305-0548, 7 p.Article

DNA based algorithms for some scheduling problemsBŁAZEWICZ, Jacek; FORMANOWICZ, Piotr; URBANIAK, Radosław et al.Lecture notes in computer science. 2003, pp 673-683, issn 0302-9743, isbn 3-540-00976-0, 11 p.Conference Paper

Choosing among algorithms to improve accuracyQUEVEDO, José Ramon; COMBARRO, Elias F; BAHAMONDE, Antonio et al.Lecture notes in computer science. 2003, pp 246-253, issn 0302-9743, isbn 3-540-40210-1, 8 p.Conference Paper

Customizable deployment, composition, and hosting of distributed Java applicationsPAAL, Stefan; KAMMÜLLER, Reiner; FREISLEBEN, Bernd et al.Lecture notes in computer science. 2002, pp 845-865, issn 0302-9743, isbn 3-540-00106-9, 21 p.Conference Paper

Polynomial algorithms for single machine scheduling problems with financial constraintsXIE, J.Operations research letters. 1997, Vol 21, Num 1, pp 39-42, issn 0167-6377Article

Single machine scheduling with flow allowancesADAMOPOULOS, G. I; PAPPIS, C. P.The Journal of the Operational Research Society. 1996, Vol 47, Num 10, pp 1280-1285, issn 0160-5682Article

The weighted common due date single machine scheduling problem revisitedSZWARC, W.Computers & operations research. 1996, Vol 23, Num 3, pp 255-262, issn 0305-0548Article

A note on improving the performance of the enhanced dynamic cycle lengths heuristic for the multi-item, single machine scheduling problemGASCON, A; LEACHMAN, R. C; LEFRANCOIS, P et al.International journal of production research. 1995, Vol 33, Num 3, pp 869-873, issn 0020-7543Article

Processing-plus-wait due dates in single-machine schedulingKAHLBACHER, H. G; CHENG, T. C. E.Journal of optimization theory and applications. 1995, Vol 85, Num 1, pp 163-186, issn 0022-3239Article

Scheduling jobs under simple linear deteriorationMOSHEIOV, G.Computers & operations research. 1994, Vol 21, Num 6, pp 653-659, issn 0305-0548Article

Single machine earliness-tardiness scheduling problems using the equal-slack ruleOGUZ, C; DINCER, C.The Journal of the Operational Research Society. 1994, Vol 45, Num 5, pp 589-594, issn 0160-5682Article

The stochastic single machine scheduling problem with earliness and tardiness costsSOROUSH, H. M; FREDENDALL, L. D.European journal of operational research. 1994, Vol 77, Num 2, pp 287-302, issn 0377-2217Article